Additive Guarantees for Degree-Bounded Directed Network Design
نویسندگان
چکیده
منابع مشابه
Online Degree-Bounded Steiner Network Design
We initiate the study of degree-bounded network design problems in the online setting. The degree-bounded Steiner tree problem – which asks for a subgraph with minimum degree that connects a given set of vertices – is perhaps one of the most representative problems in this class. This paper deals with its well-studied generalization called the degree-bounded Steiner forest problem where the con...
متن کاملImproved Algorithm for Degree Bounded Survivable Network Design Problem
We consider the Degree-Bounded Survivable Network Design Problem: the objective is to find a minimum cost subgraph satisfying the given connectivity requirements as well as the degree bounds on the vertices. If we denote the upper bound on the degree of a vertex v by b(v), then we present an algorithm that finds a solution whose cost is at most twice the cost of the optimal solution while the d...
متن کاملA Unified Algorithm for Degree Bounded Survivable Network Design
We present an approximation algorithm for the minimum bounded degree Steiner network problem that returns a Steiner network of cost at most two times the optimal and the degree on each vertex v is at most min{bv + 3rmax, 2bv + 2}, where rmax is the maximum connectivity requirement and bv is the given degree bound on v. This unifies, simplifies, and improves the previous results for this problem.
متن کاملOnline Degree-Bounded Steiner Network
The problem of satisfying connectivity demands on a graph while respecting given constraints has been a pillar of the area of network design since the early seventies [45, 14, 13, 12, 41]. The problem of degree-bounded spanning tree, introduced in Garey and Johnson’s Black Book of NP-Completeness [37], was first investigated in the pioneering work of Fürer and Raghavachari [17] (Allerton’90). I...
متن کاملOptimal Efficiency Guarantees for Network Design Mechanisms
A cost-sharing problem is defined by a set of players vying to receive some good or service, and a cost function describing the cost incurred by the auctioneer as a function of the set of winners. A costsharing mechanism is a protocol that decides which players win the auction and at what prices. Three desirable but provably mutually incompatible properties of a cost-sharing mechanism are: ince...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2010
ISSN: 0097-5397,1095-7111
DOI: 10.1137/080734340